Determination of the Shortest Transport Route Among Silk Road Corridors by Using Dijkstra Algorithm
نویسندگان
چکیده
Çin, çok tarafl? ula?t?rma politikalar? ve 21. yy. ?pek Yolunu olu?turma hedefi kapsam?nda 2013 y?l?nda tarihi bir ad?m atm??t?r. “Ku?ak Yol” slogan? ile Pekin’ den Londra’ ya ula?an yeni ticaret yolunun projesini aç?klam?? güzergâh ülkelerine i? birli?i ça?r?s?na bulunmu?tur. Modern Yolu olarak da adland?r?lan bu proje; kara, deniz demiryolu ta??mac?l???n?n kullan?larak Çin güzergâhtaki 65’den fazla ülkeyi birbirine ba?lanmay?, ülkelerde dengeli sürdürülebilir ekonomik kalk?nmalar? hedeflemektedir. Türkiye co?rafi jeopolitik konumu sayesinde en önemli ülkelerinden birisi birli?inden beklentisi olan ülke durumundad?r. Dolay?s?yla Türkiye; demiryolu, karayolu, tüp geçitler bo?az köprüleri ba?ta olmak üzere birçok yat?r?ma imza Literatürde sosyal bilimler alanlar?nda ilgili çal??ma mevcuttur. Fakat çal??mada konuya mühendislik uygulamalar? yakla??m?yla, tüm politik ko?ullardan ba??ms?z optimal sonuç elde etme amac? güdülmü?tür. Bu amaçla yolu Koridorlar?nda Pekin’den Londra’ya a?? için toplam 26 dü?ümden olu?an graf olu?turulmu? k?sa yolun hesaplanmas? Dijkstra algoritmas? Python programlama dilinde kodlanarak çözülmü?tür. veya Orta Koridor güzergâh?n Pekin-Londra aras? güzergâh? oldu?u sonucuna ula??lm??t?r.
منابع مشابه
Dijkstra ’ s Shortest Path Algorithm
The underlying principle of the algorithm may be described as follows: the algorithm starts with the source; it visits the vertices in order of increasing cost, and maintains a set V of visited vertices (denoted by UsedVx in the article) whose cost from the source has been computed, and a tentative cost D(u) to each unvisited vertex u. In the article, the set of all unvisited vertices is denote...
متن کاملDijkstra Shortest Path Algorithm using Global Positioning System
Dijkstra’s Algorithm is used to find the shortest path from one node to another node in a graph.Dijkstra’s algorithm is also known as a single source shortest path algorithm. It is applied only on positive weights. In this paper, Global Positioning System is used for adding a new functionality in Dijkstra’s algorithm. In this paper, using Global Positioning System the position parameter is adde...
متن کاملAn Improved Dijkstra Shortest Path Algorithm
An improved Dijkstra shortest path algorithm is presented in this paper. The improved algorithm introduces a constraint function with weighted value to solve the defects of the data structure storage, such as lots of redundancy of space and time. The number of search nodes is reduced by ignoring reversed nodes and the weighted value is flexibly changed to adapt to different network complexity. ...
متن کاملAn Adaptive Distributed Dijkstra Shortest Path Algorithm
We give a distributed algorithm to compute shortest paths in a network with changing topology. It does not suffer from the routing table looping behavior associated with the Ford-Bellman tdistributed shortest path algorithm although it uses truly distributed processing. Its time and message complexities are evaluated. Pierre Humblet is with the Laboratory for Information and Decision Systems, M...
متن کاملDijkstra ’ s shortest paths algorithm Vassos
Shown below is pseudocode for Dijkstra’s algorithm. The input is a directed graph G = (V,E) with nonnegative edge weights wt(u, v) for every edge (u, v) ∈ E, and a distinguished node s, called the source (or start) node. The algorithm computes, for each node u ∈ V , the weight of a shortest path from s to u. (It can be easily modified to compute, for each node u, the predecessor of u in a short...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Demiryolu mühendisli?i
سال: 2021
ISSN: ['2149-1607']
DOI: https://doi.org/10.47072/demiryolu.811572